Improved composite confidence mechanisms for a perceptron branch predictor
نویسندگان
چکیده
In 2001, Jiménez and Lin [Dynamic branch prediction with perceptrons, Proceedings of the 7th International Symposium on High Performance Computer Architecture, 2001, pp. 197–206] introduced the perceptron branch predictor, the first dynamic branch predictor to successfully use neural networks. This simple neural network achieves higher accuracies (95% at a 4 KiB hardware budget) compared to other existing branch predictors and provides a free confidence level. In this paper, we first gain insight into this inherent confidence mechanism of the perceptron predictor and explain why (additional) counter based confidence strategies can complement it. Second, we evaluate several composite confidence estimation strategies and compare them to the described technique by Jiménez and Lin [Composite confidence estimators for enhanced speculation control, Tech. rep., Department of Computer Sciences, The University of Texas at Austin, 2002]. We conclude that our overruling AND-combination of perceptron confidence and resetting counter mechanism outperforms the previously proposed confidence scheme. 2005 Elsevier B.V. All rights reserved.
منابع مشابه
Revisiting the Perceptron Predictor Again
We introduce a new kind of branch predictor, the hashed perceptron predictor, which merges the concepts behind the gshare and perceptron branch predictors. This is done by fetching the perceptron weights using the exclusive-or of branch addresses and branch history. This predictor can achieve superior accuracy to a path-based and a global perceptron predictor, previously the most accurate fully...
متن کاملThe Combined Perceptron Branch Predictor
Previous works have shown that neural branch prediction techniques achieve far lower misprediction rate than traditional approaches. We propose a neural predictor based on two perceptron networks: the Combined Perceptron Branch Predictor. The predictor consists of two concurrent perceptron-like neural networks; one using as inputs branch history information, the other one program counter bits. ...
متن کاملConfidence Measure for Experimental Automatic Face Recognition System
This paper deals with automatic face recognition in order to propose and implement an experimental face recognition system. It will be used to automatically annotate photographs taken in completely uncontrolled environment. Recognition accuracy of such a system can be improved by identification of incorrectly classified samples in the postprocessing step. However, this step is usually missing i...
متن کاملA3PBP: A Path Traced Perceptron Branch Predictor Using Local History for Weight Selection
In this paper, we present a new perceptron branch predictor called Advanced Anti-Aliasing Perceptron Branch Predictor (APBP), which can be reasonably implemented as part of a modern micro-processor. Features of the predictor are twofold: (1) Local history is used as part of the index for weight tables; (2) Execution path history is effectively used. Contrary to global/local perceptron branch pr...
متن کاملParallel Path Based Local Perceptron Branch Predictor
As the number of pipeline stages increases we become hostage to the penalty imposed by misprediction of branches. Previous works have shown that a neural branch predictor remains victorious among its peers by achieving much lower misprediction rates on similar sized hardware budget than traditional approaches. In this paper we implement 3 variations of perceptron based predictor and give each i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Systems Architecture
دوره 52 شماره
صفحات -
تاریخ انتشار 2006